cAnt-Miner: An Ant Colony Classification Algorithm to Cope with Continuous Attributes
نویسندگان
چکیده
This paper presents an extension to Ant-Miner, named cAntMiner (Ant-Miner coping with continuous attributes), which incorporates an entropy-based discretization method in order to cope with continuous attributes during the rule construction process. By having the ability to create discrete intervals for continuous attributes “on-the-fly”, cAnt-Miner does not requires a discretization method in a preprocessing step, as Ant-Miner requires. cAnt-Miner has been compared against AntMiner in eight public domain datasets with respect to predictive accuracy and simplicity of the discovered rules. Empirical results show that creating discrete intervals during the rule construction process facilitates the discovery of more accurate and significantly simpler classification rules.
منابع مشابه
Utilizing multiple pheromones in an ant-based algorithm for continuous-attribute classification rule discovery
The cAnt-Miner algorithm is an Ant Colony Optimization (ACO) based technique for classification rule discovery in problem domains which include continuous attributes. In this paper, we propose several extensions to cAntMiner. The main extension is based on the use of multiple pheromone types, one for each class value to be predicted. In the proposed μcAnt-Miner algorithm, an ant first selects a...
متن کاملData classification by Fuzzy Ant-Miner
In this paper we propose an extension of classification algorithm based on ant colony algorithms to handle continuous valued attributes using the concepts of fuzzy logic. The ant colony algorithms transform continuous attributes into nominal attributes by creating clenched discrete intervals. This may lead to false predictions of the target attribute, especially if the attribute value history i...
متن کاملImproving the Interpretability of Classification Rules Discovered by an Ant Colony Algorithm: Extended Results
Most ant colony optimization (ACO) algorithms for inducing classification rules use a ACO-based procedure to create a rule in a one-at-a-time fashion. An improved search strategy has been proposed in the cAnt-Miner[Formula: see text] algorithm, where an ACO-based procedure is used to create a complete list of rules (ordered rules), i.e., the ACO search is guided by the quality of a list of rule...
متن کاملFORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION
Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...
متن کاملA New Ant Colony Algorithm for Multi-Label Classification with Applications in Bioinformatics
The conventional classification task of data mining can be called single-label classification, since there is a single class attribute to be predicted. This paper addresses a more challenging version of the classification task, where there are two or more class attributes to be predicted. We propose a new ant colony algorithm for the multi-label classification task. The new algorithm, called Mu...
متن کامل